Fast algorithms for setting up the stiffness matrix in hp-FEM: a comparison

نویسندگان

  • T. Eibner
  • J. M. Melenk
چکیده

We analyze and compare different techniques to set up the stiffness matrix in the hp-version of the finite element method. The emphasis is on methods for second order elliptic problems posed on meshes including triangular and tetrahedral elements. The polynomial degree may be variable. We present a generalization of the Spectral Galerkin Algorithm of [7], where the shape functions are adapted to the quadrature formula, to the case of triangles/tetrahedra. Additionally, we study on-the-fly matrix-vector multiplications, where merely the matrix-vector multiplication is realized without setting up the stiffness matrix. Numerical studies are included.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Finite Element Method Using Multi-Step Mesh Process

This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...

متن کامل

Fast Summation Techniques for Sparse Shape Functions in Tetrahedral hp-FEM

This paper considers the hp-finite element discretization of an elliptic boundary value problem using tetrahedral elements. The discretization uses a polynomial basis in which the number of nonzero entries per row is bounded independently of the polynomial degree. The authors present an algorithm which computes the nonzero entries of the stiffness matrix in optimal complexity. The algorithm is ...

متن کامل

Adaptive hp-FEM with Arbitrary-Level Hanging Nodes for Maxwell’s Equations

Adaptive higher-order finite element methods (hp-FEM) are well known for their potential of exceptionally fast (exponential) convergence. However, most hp-FEM codes remain in an academic setting due to an extreme algorithmic complexity of hp-adaptivity algorithms. This paper aims at simplifying hpadaptivity for H(curl)-conforming approximations by presenting a novel technique of arbitrary-level...

متن کامل

Fast Stiffness Matrix Calculation for Nonlinear Finite Element Method

We propose a fast stiffness matrix calculation technique for nonlinear finite element method (FEM). Nonlinear stiffness matrices are constructed usingGreen-Lagrange strains, which are derived from infinitesimal strains by adding the nonlinear terms discarded from small deformations. We implemented a linear and a nonlinear finite element method with the same material properties to examine the di...

متن کامل

Evaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms

Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005